A population-based variable neighborhood search for the single machine total weighted tardiness problem
نویسندگان
چکیده
Available online 31 July 2008
منابع مشابه
Minimizing Total Weighted Tardiness in a Flexible Flowshop Environment Considering Batch Processing Machines
Scheduling in production environments is used as a competitive tool to improve efficiency and respond to customer requests. In this paper, a scheduling problem is investigated in a three-stage flexible flowshop environment with the consideration of blocking and batch processing. This problem has been inspired by the charging and packaging line of a large battery manufacturer. In this environmen...
متن کاملAn improved memetic algorithm to minimize earliness–tardiness on a single batch processing machine
In this research, a single batch processing machine scheduling problem with minimization of total earliness and tardiness as the objective function is investigated.We first formulate the problem as a mixed integer linear programming model. Since the research problem is shown to be NP-hard, an improved memetic algorithmis proposed to efficiently solve the problem. To further enhance the memetic ...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملNeighborhoods Revisited: An Experimental Investigation into the Effectiveness of Variable Neighborhood Descent for Scheduling
Variable neighborhood search (VNS) systematically exploits the idea to alternate between neighborhoods within a local search [4]. Several VNS variants have been described so far and many of them have been applied with success to a variety of combinatorial optimization problems; see [3, 4] for an overview. Yet, even though scheduling is a central problem in production environments, we are not aw...
متن کاملA Variable Neighborhood Search for the Single Machine Total Stepwise Tardiness Problem
A new type of tardy cost, called stepwise tardiness, is considered in a single machine problem. The stepwise tardiness scheduling has been found in many practical situations. To the best of our knowledge, there exist few studies directly addressing the problem. In this paper, we develop a heuristic for the single machine total stepwise tardiness (SMTST) problem. In addition, a variable neighbor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 36 شماره
صفحات -
تاریخ انتشار 2009